An alternative characterization of weak order dependence

Control dependence forms the basis for many program analyses, such as program slicing. Recent work on control dependence analysis has led to new definitions of dependence that can cater for reactive programs with their necessarily non–terminating computations. One important such definition is the definition of Weak Order Dependence, which was introduced to generalize classical control dependence for a control flow graph (CFG) without exit nodes. In this paper we show that for a standard CFG (where all nodes are reachable from each other), weak order dependence can be expressed in terms of traditional control dependence where one node has been converted into an end node.